Construction of reversible cellular automata by amalgamations and permutations of states

نویسندگان

  • Juan Carlos Seck Tuoh Mora
  • Manuel González Hernández
  • Harold V. McIntosh
  • Sergio Víctor Chapa Vergara
چکیده

Cellular automata are discrete dynamical systems characterized by simple local interactions among their components which are able to produce complex global behaviors, reason why they have been used to simulate natural and artificial systems and for implementing new paradigms of unconventional computing [I, 21. A classical study in dynamical systems is to understand reversible properties; in cellular automata the initial works in

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...

متن کامل

On the semantic security of cellular automata based pseudo-random permutations using results from the Luby-Racko construction

This paper proposes a semantically secure construction of pseudo-random permutations using second-order reversible cellular automata. We show that the proposed construction is equivalent to the LubyRacko model if it is built using non-uniform transition rules, and we prove that the construction is strongly secure if an adequate number of iterations is performed. Moreover, a corresponding symmet...

متن کامل

On generalization of reversible second-order cellular automata

A cellular automaton with n states may be used for construction of reversible second-order cellular automaton with n states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such construction and may have number of states N = nm with arbitrary m. Further modification produces reversible cellular automata with reduced number of states N ′ < N = nm.

متن کامل

Novel Design of n-bit Controllable Inverter by Quantum-dot Cellular Automata

Application of quantum-dot is a promising technology for implementing digital systems at nano-scale.  Quantum-dot Cellular Automata (QCA) is a system with low power consumption and a potentially high density and regularity. Also, QCA supports the new devices with nanotechnology architecture. This technique works </...

متن کامل

Amalgamation of cellular automata

In this paper, we study amalgamations of cellular automata (CA), i.e. ways of combining two CA by disjoint union. We show that for several families of CA obtained by simple amalgamation operations (including the well-known families of majority and minority CA), the density of a large class of properties follows a zero-one law. Besides, we establish that intrinsic universality in those families ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Cellular Automata

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2008